Syntactic Labelled Tableaux for Lukasiewicz Fuzzy ALC
نویسندگان
چکیده
Fuzzy description logics (DLs) serve as a tool to handle vagueness in real-world knowledge. There is particular interest in logics implementing Łukasiewicz semantics, which has a number of favourable properties. Current decision procedures for Łukasiewicz fuzzy DLs work by reduction to exponentially large mixed integer programming problems. Here, we present a decision method that stays closer to logical syntax, a labelled tableau algorithm for Łukasiewicz FuzzyALC that calls only on (pure) linear programming, and this only to decide atomic clashes. The algorithm realizes the best known complexity bound, NEXPTIME. Our language features a novel style of fuzzy ABoxes that work with comparisons of truth degrees rather than explicit numerical bounds.
منابع مشابه
On the Undecidability of Fuzzy Description Logics with GCIs with Lukasiewicz t-norm
Recently there have been some unexpected results concerning Fuzzy Description Logics (FDLs) with General Concept Inclusions (GCIs). They show that, unlike the classical case, the DL ALC with GCIs does not have the finite model property under Lukasiewicz Logic or Product Logic and, specifically, knowledge base satisfiability is an undecidable problem for Product Logic. We complete here the analy...
متن کاملA Framework for Reasoning with Expressive Continuous Fuzzy Description Logics
In the current paper we study the reasoning problem for fuzzy SI (f-SI) under arbitrary continuous fuzzy operators. Our work can be seen as an extension of previous works that studied reasoning algorithms for f-SI, but focused on specific fuzzy operators, e.g. fKD-SI and of reasoning algorithms for less expressive fuzzy DLs, like fL-ALC and fP -ALC (fuzzy ALC under the Lukasiewicz and product f...
متن کاملReasoning in the presence of inconsistency through Preferential ALC
This paper presents an inconsistency tolerant semantics for the Description Logic ALC called Preferential ALC (p-ALC ). A p-ALC knowledge base is comprised of defeasible and non-defeasible axioms. The defeasible ABox and TBox are labelled with confidence weights that could reflect an axiom’s provenance. Entailment is defined through the notion of preferred interpretations which minimise the tot...
متن کاملFuzzy ALC with Fuzzy Concrete Domains
We present a fuzzy description logic where the representation of concept membership functions and fuzzy modifiers is allowed, together with a inference procedure based on a mixture of a tableaux and bounded mixed integer programming.
متن کاملOn the Failure of the Finite Model Property in some Fuzzy Description Logics
Fuzzy Description Logics (DLs) are a family of logics which allow the representation of (and the reasoning with) structured knowledge affected by vagueness. Although most of the not very expressive crisp DLs, such as ALC, enjoy the Finite Model Property (FMP), this is not the case once we move into the fuzzy case. In this paper we show that if we allow arbitrary knowledge bases, then the fuzzy ...
متن کامل